0.06/0.11 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.06/0.11 % Command : run_vampire %s %d THM 0.10/0.32 % Computer : n022.cluster.edu 0.10/0.32 % Model : x86_64 x86_64 0.10/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.10/0.32 % Memory : 8042.1875MB 0.10/0.32 % OS : Linux 3.10.0-693.el7.x86_64 0.10/0.32 % CPULimit : 1920 0.10/0.32 % WCLimit : 240 0.10/0.32 % DateTime : Wed Jul 30 08:46:19 EDT 2025 0.10/0.32 % CPUTime : 0.10/0.33 This is a THF_ problem 0.10/0.33 Running higher-order theorem proving 0.10/0.34 Running /export/starexec/sandbox/solver/bin/vampire_ho --cores 7 --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol /export/starexec/sandbox/tmp/tmp.5NqIett0LE/E---3.1_20850.p -m 16384 -t 240 0.10/0.36 % (20958)lrs+10_1:1_c=on:cnfonf=conj_eager:fd=off:fe=off:kws=frequency:spb=intro:i=4:si=on:rtra=on_0 on E---3.1_20850 for (2399ds/4Mi) 0.10/0.36 % (20961)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on E---3.1_20850 for (2399ds/2Mi) 0.10/0.36 % (20962)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on E---3.1_20850 for (2399ds/275Mi) 0.10/0.36 % (20963)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on E---3.1_20850 for (2399ds/18Mi) 0.10/0.36 % (20960)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on E---3.1_20850 for (2399ds/2Mi) 0.10/0.36 % (20957)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on E---3.1_20850 for (2399ds/183Mi) 0.10/0.36 % (20959)dis+1010_1:1_au=on:cbe=off:chr=on:fsr=off:hfsq=on:nm=64:sos=theory:sp=weighted_frequency:i=27:si=on:rtra=on_0 on E---3.1_20850 for (2399ds/27Mi) 0.10/0.36 % (20962)Refutation not found, incomplete strategy 0.10/0.36 % (20962)------------------------------ 0.10/0.36 % (20962)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200) 0.10/0.36 % (20962)Termination reason: Refutation not found, incomplete strategy 0.10/0.36 0.10/0.36 0.10/0.36 % (20962)Memory used [KB]: 5373 0.10/0.36 % (20962)Time elapsed: 0.003 s 0.10/0.36 % (20962)Instructions burned: 1 (million) 0.10/0.36 % (20962)------------------------------ 0.10/0.36 % (20962)------------------------------ 0.10/0.36 % (20959)Refutation not found, incomplete strategy 0.10/0.36 % (20959)------------------------------ 0.10/0.36 % (20959)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200) 0.10/0.36 % (20959)Termination reason: Refutation not found, incomplete strategy 0.10/0.36 0.10/0.36 0.10/0.36 % (20959)Memory used [KB]: 5500 0.10/0.36 % (20959)Time elapsed: 0.002 s 0.10/0.36 % (20959)Instructions burned: 1 (million) 0.10/0.36 % (20959)------------------------------ 0.10/0.36 % (20959)------------------------------ 0.10/0.36 % (20960)First to succeed. 0.10/0.36 % (20961)Refutation not found, incomplete strategy 0.10/0.36 % (20961)------------------------------ 0.10/0.36 % (20961)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200) 0.10/0.36 % (20961)Termination reason: Refutation not found, incomplete strategy 0.10/0.36 0.10/0.36 0.10/0.36 % (20961)Memory used [KB]: 5500 0.10/0.36 % (20961)Time elapsed: 0.004 s 0.10/0.36 % (20961)Instructions burned: 1 (million) 0.10/0.36 % (20961)------------------------------ 0.10/0.36 % (20961)------------------------------ 0.10/0.36 % (20958)Instruction limit reached! 0.10/0.36 % (20958)------------------------------ 0.10/0.36 % (20958)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200) 0.10/0.36 % (20958)Termination reason: Unknown 0.10/0.36 % (20958)Termination phase: Saturation 0.10/0.36 0.10/0.36 % (20958)Memory used [KB]: 5500 0.10/0.36 % (20958)Time elapsed: 0.005 s 0.10/0.36 % (20958)Instructions burned: 4 (million) 0.10/0.36 % (20958)------------------------------ 0.10/0.36 % (20958)------------------------------ 0.10/0.36 % (20960)Refutation found. Thanks to Tanya! 0.10/0.36 % SZS status Theorem for E---3.1_20850 0.10/0.36 % SZS output start Proof for E---3.1_20850 0.10/0.36 thf(func_def_0, type, f: $i > $i). 0.10/0.36 thf(func_def_4, type, sK0: ($i > $i) > $i). 0.10/0.36 thf(func_def_6, type, inv_f_2: $i > $i). 0.10/0.36 thf(func_def_7, type, ph3: !>[X0: $tType]:(X0)). 0.10/0.36 thf(f17,plain,( 0.10/0.36 $false), 0.10/0.36 inference(trivial_inequality_removal,[],[f16])). 0.10/0.36 thf(f16,plain,( 0.10/0.36 ((sK0 @ inv_f_2) != (sK0 @ inv_f_2))), 0.10/0.36 inference(superposition,[],[f12,f14])). 0.10/0.36 thf(f14,plain,( 0.10/0.36 ( ! [X0 : $i] : (((inv_f_2 @ (f @ X0)) = X0)) )), 0.10/0.36 inference(injectivity,[],[f13])). 0.10/0.36 thf(f13,plain,( 0.10/0.36 ( ! [X0 : $i,X1 : $i] : (((f @ X0) != (f @ X1)) | (X0 = X1)) )), 0.10/0.36 inference(cnf_transformation,[],[f11])). 0.10/0.36 thf(f11,plain,( 0.10/0.36 ! [X0,X1] : ((X0 = X1) | ((f @ X0) != (f @ X1)))), 0.10/0.36 inference(rectify,[],[f7])). 0.10/0.36 thf(f7,plain,( 0.10/0.36 ! [X1,X0] : ((X0 = X1) | ((f @ X0) != (f @ X1)))), 0.10/0.36 inference(ennf_transformation,[],[f6])). 0.10/0.36 thf(f6,plain,( 0.10/0.36 ! [X0,X1] : (((f @ X0) = (f @ X1)) => (X0 = X1))), 0.10/0.36 inference(rectify,[],[f1])). 0.10/0.36 thf(f1,axiom,( 0.10/0.36 ! [X1,X0] : (((f @ X0) = (f @ X1)) => (X0 = X1))), 0.10/0.36 file('/export/starexec/sandbox/tmp/tmp.5NqIett0LE/E---3.1_20850.p',finj)). 0.10/0.36 thf(f12,plain,( 0.10/0.36 ( ! [X0 : $i > $i] : (((sK0 @ X0) != (X0 @ (f @ (sK0 @ X0))))) )), 0.10/0.36 inference(cnf_transformation,[],[f10])). 0.10/0.36 thf(f10,plain,( 0.10/0.36 ! [X0 : $i > $i] : ((sK0 @ X0) != (X0 @ (f @ (sK0 @ X0))))), 0.10/0.36 inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f8,f9])). 0.10/0.36 thf(f9,plain,( 0.10/0.36 ! [X0 : $i > $i] : (? [X1] : ((X0 @ (f @ X1)) != X1) => ((sK0 @ X0) != (X0 @ (f @ (sK0 @ X0)))))), 0.10/0.36 introduced(choice_axiom,[])). 0.10/0.36 thf(f8,plain,( 0.10/0.36 ! [X0 : $i > $i] : ? [X1] : ((X0 @ (f @ X1)) != X1)), 0.10/0.36 inference(ennf_transformation,[],[f5])). 0.10/0.36 thf(f5,plain,( 0.10/0.36 ~? [X0 : $i > $i] : ! [X1] : ((X0 @ (f @ X1)) = X1)), 0.10/0.36 inference(rectify,[],[f3])). 0.10/0.36 thf(f3,negated_conjecture,( 0.10/0.36 ~? [X2 : $i > $i] : ! [X0] : ((X2 @ (f @ X0)) = X0)), 0.10/0.36 inference(negated_conjecture,[],[f2])). 0.10/0.36 thf(f2,conjecture,( 0.10/0.36 ? [X2 : $i > $i] : ! [X0] : ((X2 @ (f @ X0)) = X0)), 0.10/0.36 file('/export/starexec/sandbox/tmp/tmp.5NqIett0LE/E---3.1_20850.p',invexists)). 0.10/0.36 % SZS output end Proof for E---3.1_20850 0.10/0.36 % (20960)------------------------------ 0.10/0.36 % (20960)Version: Vampire 4.8 (commit 11aac991b on 2023-10-04 16:26:07 +0200) 0.10/0.36 % (20960)Termination reason: Refutation 0.10/0.36 0.10/0.36 % (20960)Memory used [KB]: 5500 0.10/0.36 % (20960)Time elapsed: 0.003 s 0.10/0.36 % (20960)Instructions burned: 1 (million) 0.10/0.36 % (20960)------------------------------ 0.10/0.36 % (20960)------------------------------ 0.10/0.36 % (20956)Success in time 0.017 s 0.10/0.36 EOF